A Distributed Search for Strongly Regular Graphs
نویسندگان
چکیده
It is useful to run computational experiments for many discrete mathematics problems. Many of the remaining open problems require computational resources beyond that of a single researcher. Distributed computing is a way to share computing resources. This work implements a library that provides the features of distributed computing to researchers in a framework specific to a tree-based search.
منابع مشابه
CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملRandom strongly regular graphs?
Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36,10,4,2), but there are 32548 non-isomorphic graphs with parameters (36,15,6,6). (The first assertion is a special case of a theorem of Shrikhande, while the second is the result of a computer search by McKay and Spence.) In the light of th...
متن کاملThe search for N-e.c. graphs
Almost all finite graphs have the n-e.c. adjacency property, although until recently few explicit examples of such graphs were known. We survey some recently discovered families of explicit finite n-e.c. graphs, and present a new construction of strongly regular n-e.c. arising from affine planes.
متن کاملClassification of some strongly regular subgraphs of the McLaughlin graph
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, λ, μ) = (105, 32, 4, 12), (120, 42, 8, 18) and (176, 70, 18, 34) are unique upto isomorphism. Each of these graphs occurs as an induced subgraph in the strongly regular McLaughlin graph. We have used an orderly backtracking algorithm with look-ahead and look-back strategies, applying...
متن کاملStrongly walk - regular grapsh
We study a generalization of strongly regular graphs. We call a graph strongly walkregular if there is an ` > 1 such that the number of walks of length ` from a vertex to another vertex depends only on whether the two vertices are the same, adjacent, or not adjacent. We will show that a strongly walk-regular graph must be an empty graph, a complete graph, a strongly regular graph, a disjoint un...
متن کامل